Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
نویسندگان
چکیده
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several constraints like station capacities and train dependent running and headway times have to be satisfied. In this work we deal with large scale instances of the aperiodic train timetabling problem for the German railway network. The problem is modelled in a classical way via time discretised networks, its Lagrange-dual is solved by a bundle method. In order to handle the enormous number of variables and constraints dynamic graph generation and dynamic rolling horizon techniques are employed. 1998 ACM Subject Classification G.1.6 [Numerical Analysis]: Optimization
منابع مشابه
Dynamic Graph Generation for Large Scale Operational Train Timetabling
The aim of operational train timetabling is to find a conflict free timetable for a set of passenger and freight trains with predefined stopping time windows along given routes in an infrastructure network so that station capacities and train dependent running and headway times are observed. Typical models for this problem are based on time-discretized networks for the train routes coupled by c...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملSolving infinite horizon optimal control problems of nonlinear interconnected large-scale dynamic systems via a Haar wavelet collocation scheme
We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...
متن کاملA Fast and Efficient Adaptive Large Neighborhood Search Heuristic for the Passenger Train Timetabling Problem with Dynamic Demand
The railway planning process is a complex activity which is usually decomposed into a succession of stages, traditionally network design, line design, timetabling, rolling stock, and personnel planning. In this paper, we study the design and optimization of train timetables adapted to a dynamic demand environment. The objective is to minimize passenger waiting times at the stations. We first de...
متن کاملRobust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach
After a major service disruption on a single-track rail line, dispatchers need to generate a series of train meet-pass plans at different decision times of the rescheduling stage. The task is to recover the impacted train schedule from the current and future disturbances and minimize the expected additional delay under different forecasted operational conditions. Based on a stochastic programmi...
متن کامل